A Graph Transformational View on Reductions in NP
نویسندگان
چکیده
Many decision problems in the famous and challenging complexity class NP are graph problems and can be adequately specified by polynomial graph transformation units. In this paper, we propose to model the reductions in NP by means of a special type of polynomial graph transformation units, too. Moreover, we present some first ideas how the semantic requirements of reductions including their correctness can be proved in a systematic way.
منابع مشابه
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic
We explore the possibility of automating NP-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order existential (SO∃) logic as representation language for decision problems. Building upon the theoretical framework of J. Antonio Medina, we explore the possibility of implementing seven syntactic operators. Each operator transf...
متن کاملRandomized Reductions and Isomorphisms
Randomizing reductions have provided new techniques for tackling average-case complexity problems. For example, although some NP-complete problems with uniform distributions on instances cannot be complete under deterministic one-one reductions [WB95], they are complete under randomized reductions [VL88]. We study randomized reductions in this paper on reductions that are one-one and honest map...
متن کاملEdge Weight Reduction Problems in Directed Acyclic Graphs
Let G be a weighted, direr.ted, acyclic graph in which each edge weight. is not a staticquantity, but can be reduced for a certain cost. In this paper we consider the problem of determining which edg('s to reduce so that the length of the longest paths is minimized and the total cost associated with the reductions does not exceed a given cost. We consider two type-s of edge reductions, linear r...
متن کاملAn Average Case NP-Complete Graph Coloring Problem
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under all samplable (i.e., generatable in polynomial time) distributions ...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ECEASST
دوره 61 شماره
صفحات -
تاریخ انتشار 2013